Inapproximability Some history and some open problems
نویسنده
چکیده
The purpose of this talk is to give an overview of the status of some problems in approximability.
منابع مشابه
Lecture 1: Approximation Algorithms, Approximation Ratios, Gap Problems
To date, thousands of natural optimization problems have been shown to be NP-hard [6, 13]. Designing approximation algorithms [4, 17, 21] has become a standard path to attack these problems. For some problem, however, it is even NP-hard to approximate the optimal solution to within a certain ratio. The TRAVELING SALESMAN PROBLEM (TSP), for instance, has no approximation algorithm, since finding...
متن کاملOn Some Tighter Inapproximability Results
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurence satis ability problems like MAX2SAT and E2-LIN-2, and the bounded degree graph problems, like MIS, Node Cover, and MAX CUT. We prove also for the rst time inapproximability of the problem of Sorting by Reversals and display an explicit approximation thres...
متن کاملOn some open problems in cone metric space over Banach algebra
In this paper we prove an analogue of Banach and Kannan fixed point theorems by generalizing the Lipschitz constat $k$, in generalized Lipschitz mapping on cone metric space over Banach algebra, which are answers for the open problems proposed by Sastry et al, [K. P. R. Sastry, G. A. Naidu, T. Bakeshie, Fixed point theorems in cone metric spaces with Banach algebra cones, Int. J. of Math. Sci. ...
متن کاملReducing the optimum value: FPT inapproximability, for Set Cover and Clique, in time super-exponential in opt
Fixed parameter ρ(k) inapproximability in minimization problems, is given some instance I of a problem with optimum opt, find some k ≥ opt, prove that it is not possible to compute a solution of value ρ(k) · k, usually, under the Exponential Time Hypothesis (eth). If opt is known, inapproximability in terms of opt implies inapproximability in terms of k. An (r, t)-fpt-hardness (in opt) for two ...
متن کاملReducing the value of the optimum: FPT inapproximability for Set Cover and Clique, in super exponential time in opt
In Fixed Parameter Tractability (FPT) theory, we are given a problem with a special parameter k. In this paper we are only interested in k equal the size of the optimum. A FPT algorithm for a problem is an exact algorithm that runs in time h(k) · nO(1) for a function h that may be arbitrarily large. In FPT approximation we seek a g(k) ratio that runs in time h(k) · nO(1), so that h,g are two in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003